Convex dynamic programming for hybrid systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex dynamic programming for hybrid systems

A classical linear programming approach to optimization of flow or transportation in a discrete graph is extended to hybrid systems. The problem is finite dimensional if the state space is discrete and finite, but becomes infinite dimensional for a continuous or hybrid state space. It is shown how strict lower bounds on the optimal loss function can be computed by gridding the continuous state ...

متن کامل

Hybrid Control Laws From Convex Dynamic Programming

In a previous paper, we showed how classical ideas for dynamic programming in discrete networks can be adapted to hybrid systems. The approach is based on discretization of the continuous Bellman inequality which gives a lower bound on the optimal cost. The lower bound is maximized by linear programming to get an approximation of the optimal solution. In this paper, we apply ideas from infinite...

متن کامل

On the Minimum Principle and Dynamic Programming for Hybrid Systems

Hybrid optimal control problems are studied for systems where autonomous and controlled state jumps are allowed at the switching instants and in addition to running costs, switching between discrete states incurs costs. A key aspect of the analysis is the relationship between the Hamiltonian and the adjoint process before and after the switching instants as well as the relationship between adjo...

متن کامل

Dynamic Programming via Convex Optimization

It has long been known that a wide class of problems in optimal control can be stated as infinite-dimensional convex optimization problems, where the Bellman equation is relaxed to inequality. In this paper we continue our recent efforts to show how this formulation can be used for numerical computation of optimal cost functions and control laws. In particular, we discuss new forms of discretiz...

متن کامل

Hybrid Dynamic Programming

In this paper we outline the derivation of a hybrid Hamilton-JacobiBellman equation for our Multiple Agent Hybrid Control Architecture (MACHA) [5, 4] and a hybrid system dynamic programming methodology.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2002

ISSN: 0018-9286

DOI: 10.1109/tac.2002.802753